Two-Bend Three-Dimensional Orthogonal Grid Drawing of Maximum Degree Five Graphs
نویسنده
چکیده
Some recent algorithms for 3-dimensional orthogonal graph drawing use no more than 3 bends per edge route. It is unknown if there exists a graph requiring a 3-bend edge route. In this paper we present an algorithm for 2-bend 3-dimensional orthogonal grid drawing of maximum degree 5 graphs. In addition 2-bend 3-dimensional grid drawings of the 6-regular multi-partite graphs are given.
منابع مشابه
Optimal three-dimensional orthogonal graph drawing in the general position model
Let G be a graph with maximum degree at most six. A three-dimensional orthogonal drawing of G positions the vertices at grid-points in the three-dimensional orthogonal grid, and routes edges along grid lines such that edge routes only intersect at common end-vertices. In this paper, we consider three-dimensional orthogonal drawings in the general position model; here no two vertices are in a co...
متن کاملTwo Algorithms for Three Dimensional Orthogonal Graph Drawing
We use basic results from graph theory to design two algorithms for constructing 3-dimensional, intersection-free orthogonal grid drawings of n vertex graphs of maximum degree 6. Our first algorithm gives drawings bounded by an O(x/~ ) • O(x/~ • O(v~ ) box; each edge route contains at most 7 bends. The best previous result generated edge routes containing up to 16 bends per route. Our second al...
متن کاملThree-dimensional orthogonal graph drawing algorithms
We use basic results from graph theory to design algorithms for constructing three-dimensional, intersection-free orthogonal grid drawings of n vertex graphs of maximum degree 6. The best previous result generated a drawing bounded by an O( √ n) × O( √ n) × O( √ n) box, with each edge route containing up to 16 bends. Our algorithms initiate the study of bend=bounding box trade-o issues for thre...
متن کاملAlgorithms for Area-eecient Orthogonal Drawings
An orthogonal drawing of a graph is a drawing such that nodes are placed on grid points and edges are drawn as sequences of vertical and horizontal segments. In this paper we present linear time algorithms that produce orthogonal drawings of graphs with n nodes. If the maximum degree is four, then the drawing produced by our rst algorithm needs area at most (roughly) 0:76n 2 , and introduces at...
متن کاملThe Three-Phase Method: A Unified Approach to Orthogonal Graph Drawing
In this paper, we study orthogonal graph drawings from a practical point of view. Most previously existing algorithms restricted the attention to graphs of maximum degree four. Here we study orthogonal drawing algorithms that work for any input graph, and discuss diierent models for such drawings. Then we introduce the three-phase method, a generic technique to create high-degree orthogonal dra...
متن کامل